COMPARATIVE ANALYSIS OF STROKE CLASSIFICATION USING THE K-NEAREST NEIGHBOR DECISION TREE, AND MULTILAYER PERCEPTRON METHODS
نویسندگان
چکیده
Stroke has become a serious health problem; the main cause of stroke is usually blood clot in arteries that supply to brain. Strokes can also be caused by bleeding when vessels burst and leaks into In one year, about 12.2 million people will have their first stroke, 6.5 die from stroke. More than 110 worldwide had Handling done quickly minimize level brain damage potential adverse effects. Therefore, it very important predict whether patient experience The K-Nearest Neighbor, Decision Tree, Multilayer Perceptron algorithms are applied as classification method identify symptoms patients achieve an optimal accuracy level. results making three quite good, where Neighbor (K-NN) value 93.84%, Tree 93.97%, (MLP) 93.91%. best algorithm with difference no more 0.10% two used.
منابع مشابه
K-Nearest Neighbor Classification Using Anatomized Data
This paper analyzes k nearest neighbor classification with training data anonymized using anatomy. Anatomy preserves all data values, but introduces uncertainty in the mapping between identifying and sensitive values. We first study the theoretical effect of the anatomized training data on the k nearest neighbor error rate bounds, nearest neighbor convergence rate, and Bayesian error. We then v...
متن کاملDrought Monitoring and Prediction using K-Nearest Neighbor Algorithm
Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...
متن کاملDiffusion Decision Making for Adaptive k-Nearest Neighbor Classification
This paper sheds light on some fundamental connections of the diffusion decision making model of neuroscience and cognitive psychology with k-nearest neighbor classification. We show that conventional k-nearest neighbor classification can be viewed as a special problem of the diffusion decision model in the asymptotic situation. By applying the optimal strategy associated with the diffusion dec...
متن کاملDecision Tree Rule Reduction Using Linear Classifiers in Multilayer Perceptron
It has been shown that a neural network is better than a direct application of induction trees in modeling complex relations of input attributes in sample data. We propose that concise rules be extracted to support data with input variable relations over continuous-valued attributes. Those relations as a set of linear classifiers can be obtained from neural network modeling based on back-propag...
متن کاملNearest Neighbor Classification Using The Layered Range Tree
Finding Nearest Neighbors efficiently is crucial to the design of any nearest neighbor classifier. This paper shows how Layered Range Trees could be used for efficient nearest neighbor classification. The presented algorithm is simple and finds the nearest neighbor in a logarithmic order. It performs d log n + k distance measures to find the nearest neighbor, where k is a constant that is much ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jusikom : Jurnal Sistem Informasi Ilmu Komputer
سال: 2023
ISSN: ['2580-2879']
DOI: https://doi.org/10.34012/jurnalsisteminformasidanilmukomputer.v7i1.4083